Description Logic with Constraint Propagation Rules
نویسنده
چکیده
The challenges of the Semantic Web endeavour in knowledge representation and reasoning prompted a wealth of research in combining description logic (DL) as ontology languages (e.g. OWL) with logic programming for rule-based reasoning. General issues of combining and integrating formalisms have to be faced such as the type of combination, conceptual simplicity and tractability. Even though constraint-based programming has a tradition of tackling these questions, constraint-based rule formalisms such as constraint logic programming, concurrent constraint programming, constraint databases and constraint handling rules (CHR) have not explicitely been considered for combination with DL yet. CHR is a very expressive declarative concurrent constraint-based programming language with optimal performance guarantee and other interesting properties. ...rules...
منابع مشابه
Generation of Propagation Rules for Intentionally Defined Constraints
A general approach to implement propagation and simplification of constraints consists of applying rules over these constraints. However, a difficulty that arises frequently when writing a constraint solver is to determine the constraint propagation algorithm. In previous work, different methods for automatic generation of propagation rules for constraints defined over finite domains have been ...
متن کاملAutomatic Generation of Constraint Propagation Algorithms for Small Finite Domains
We study here constraint satisfaction problems that are based on predefined, explicitly given finite constraints. To solve them we propose a notion of rule consistency that can be expressed in terms of rules derived from the explicit representation of the initial constraints. This notion of local consistency is weaker than arc consistency for constraints of arbitrary arity but coincides with it...
متن کاملGenerating Propagation Rules for Finite Domains via Uni cation in Finite Algebras
Constraint solving techniques are nowadays frequently based on constraint propagation which can be interpreted as a speciic form of deduction. Using constraint programming languages enhanced with constraint handling rules facilities, we can now perform constraint propagation just by applying deduction rules over constraints. The idea of computing propagation rules in the particular case of smal...
متن کاملA Note on Redundant Rules in Rule-Based Constraint Programming
Constraint propagation can sometimes be described conveniently in a rule-based way. Propagation is then fixpoint computation with rules. In the typical case when no specific strategy guides the fixpoint computation, it is preferable to have a minimal set of rules. We propose a natural criterion for redundancy of a rule, and describe a test for a class of rules. Its relevance is demonstrated by ...
متن کاملDescription Logic and Rules the CHR Way Extended Abstract
The challenges of the Semantic Web endeavour in knowledge representation and reasoning prompted a wealth of research in combining description logic (DL) as ontology languages (e.g. OWL) with logic programming for rule-based reasoning. General issues of combining and integrating formalisms have to be faced such as the type of combination, conceptual simplicity and tractability. Even though const...
متن کامل